1427A - Avoiding Zero - CodeForces Solution

math sortings *900

Please click on ads to support us..

Python Code: 

for pratyush in range(int(input())):
    n=int(input())
    a=list(map(int,input().split()))
    s=sum(a)
    if s==0:
        print("NO")
    else:
        print("YES")
        if s>0: a.sort(reverse=True)
        else: a.sort()
        print(*a)

C++ Code: 

#include<bits/stdc++.h>
using namespace std;
int main()
{
 // freopen("input.txt","r",stdin);
 // freopen("output.txt","w",stdout);
 int t;
 cin>>t;
  while(t--)
 {
  int n;
  cin>>n;
  int arr[n];
  for(int i=0;i<n;i++)
   cin>>arr[i];
  int psum=0 , nsum=0;
  for(int i=0;i<n;i++)
   if(arr[i]<0) nsum+=abs(arr[i]);
   else  psum+=arr[i];
  if(psum==nsum)
  cout<<"NO"<<endl;
  else
   {
     sort(arr,arr+n);
     if(psum>nsum)
      reverse(arr,arr+n);
    cout<<"YES"<<endl;
    for(int i=0;i<n;i++)
      cout<<arr[i]<<" ";
     cout<<endl;
   }
  }
  return 0;
}


Comments

Submit
0 Comments
More Questions

701. Insert into a Binary Search Tree
429. N-ary Tree Level Order Traversal
739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST
445. Add Two Numbers II
442. Find All Duplicates in an Array
437. Path Sum III
436. Find Right Interval
435. Non-overlapping Intervals
406. Queue Reconstruction by Height
380. Insert Delete GetRandom O(1)
332. Reconstruct Itinerary
368. Largest Divisible Subset
377. Combination Sum IV
322. Coin Change
307. Range Sum Query - Mutable
287. Find the Duplicate Number
279. Perfect Squares
275. H-Index II
274. H-Index
260. Single Number III
240. Search a 2D Matrix II
238. Product of Array Except Self
229. Majority Element II
222. Count Complete Tree Nodes